Network design arc set with variable upper bounds
نویسندگان
چکیده
منابع مشابه
Network design arc set with variable upper bounds
In this paper we study the network design arc set with variable upper bounds. This set appears as a common substructure of many network design problems and is a relaxation of several fundamental mixed-integer sets studied earlier independently. In particular, the splittable flow arc set, the unsplittable flow arc set, the single node fixed-charge flow set, and the binary knapsack set are facial...
متن کاملValid Inequalities for Problems with Additive Variable Upper Bounds
We study the facial structure of a polyhedron associated with the single node re laxation of network ow problems with additive variable upper bounds This type of structure arises for example in network design expansion problems in production planning problems with setup times We rst derive two classes of valid inequalities for this polyhedron and give the conditions under which they are facet d...
متن کاملBoosting Network Design with Set Constraint Propagation
This paper reconsiders the deployment of synchronous optical networks (SONET), an optimization problem naturally expressed in terms of set variables. Earlier approaches, using either MIP or CP technologies, focused on symmetry breaking, including the use of SBDS, and the design of effective branching strategies. This paper advocates an orthogonal approach and argues that the thrashing behavior ...
متن کاملNetwork Coding Bounds 17.1 Network Coding 17.1.1 Upper Bound
Start with a directed acyclic graph (DAG) with a single sender and many receivers, where each receiver has k-edge connectivity from the sender. We assume that each edge has unit capacity, say, 1 bit/second. If our initial DAG does not meet this criterion, we can easily construct one that does: first, divide edge capacities by their greatest common divisor, then replace each c-capacity edge with...
متن کاملExact Upper Bounds and Their Uses in Set Theory
The existence of exact upper bounds for increasing sequences of ordinal functions modulo an ideal is discussed. The main theorem (Theorem 18 below) gives a necessary and sufficient condition for the existence of an exact upper bound / for a \A\~*~ is regular: an eub / with liminf/cf/(a) = /x exists if and only if for every regular K E (|^4...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Networks
سال: 2007
ISSN: 0028-3045,1097-0037
DOI: 10.1002/net.20162